External Inverse Pattern Matching
نویسندگان
چکیده
In this paper we consider the externa//nverse pattern match/ng problem. Given a text T of length n over an ordered alphabet ,U and a number m <_ n, the goal is to find a pattern ~-~MAX ~ ~rn which is not a subword of T and which maximizes the sum of Hamming distances between ~MAX and all subwords of T of length m. We present an optimal O(nloga)-time (where a = 1/71) algorithm for the external inverse pattern matching problem. This substantially improves the O(nm log a)-time algorithm given in [2]. Moreover we discuss briefly fast parallel implementation of our algorithm on the CREW PRAM model.
منابع مشابه
On the inverse maximum perfect matching problem under the bottleneck-type Hamming distance
Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...
متن کاملFrom Word Form Surfaces to Communication
The starting point of this paper is the external surface of a word form, for example the agent-external acoustic perturbations constituting a language sign in speech or the dots on paper in the case of written language. The external surfaces are modality-dependent tokens which the hearer recognizes by means of (i) pattern-matching and (ii) a mapping into modality-independent types, and which th...
متن کاملUsing Pseudo-Inverse to Eliminate the Limitation of the Number of Colors in Colorimetric Match
An algorithm is suggested for implementation of unlimited primaries in two-constants Kubelka-Munk color matching attempt. Allens method for tristimulus color matching which was limited to four colorants in two constant theory, dealt with inversable matrices. By application of the pseudo-inverse, it is not necessary to limit the number of primary colors to four as Allen suggested. The suggested ...
متن کاملUsing Pseudo-Inverse to Eliminate the Limitation of the Number of Colors in Colorimetric Match
An algorithm is suggested for implementation of unlimited primaries in two-constants Kubelka-Munk color matching attempt. Allen's method for tristimulus color matching which was limited to four colorants in two constant theory, dealt with inversable matrices. By application of the pseudo-inverse, it is not necessary to limit the number of primary colors to four as Allen suggested. The suggested...
متن کاملThe Universal Resolving Algorithm: Inverse Computation in a Functional Language
R. Backhouse and J. N. Oliveira (Eds.): Mathematics of Program Construction. Proceedings. LNCS 1837, pp. 187–212, 2000. c © Springer-Verlag Berlin Heidelberg 2000 Abstract. We present an algorithm for inverse computation in a firstorder functional language based on the notion of a perfect process tree. The Universal Resolving Algorithm (URA) introduced in this paper is sound and complete, and c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997